Global k-Level Crossing Reduction

A Global k-Level Crossing Reduction Algorithm

Directed graphs are commonly drawn by the Sugiyama algorithm, where crossing reduction is a crucial phase. It is done by repeated one-sided 2-level crossing minimizations, which are still NP-hard. We introduce a global crossing reduction, which at any particular time captures all crossings, especially for long edges. Our approach is based on the sifting technique and improves the level-by-level...

A Fast and Simple Heuristic for Constrained Two-Level Crossing Reduction

The one-sided two-level crossing reduction problem is an important problem in hierarchical graph drawing. Because of its NPhardness there are many heuristics, such as the well-known barycenter and median heuristics. We consider the constrained one-sided two-level crossing reduction problem, where the relative position of certain vertex pairs on the second level is fixed. Based on the barycenter...

Informal International Border Crossing, Refugee and Illegal Migrant Workers: Issue in Travel Medicine

Level Crossing Rate of Product of Two α-k-μ Random Variables

In this paper, the product of two α-k-μ random variables is analyzed. The closed form expressions for average level crossing rate (LCR) of product of two α-k-μ random variables are determined. These expressions are used for calculation of average level crossing rate of wireless communication systems operating over α-k-μ multipath fading channels. The α-k-μ distribution can be used to describe s...

Level crossing rate of L-branch SC receiver over α-k-μ fading channel in the presence α-k-μ co-channel interference

Wireless communication system operating over interference limited, α-k-μ multipath fading channel is considered. Closed form expressions for cumulative distribution function and level crossing rate of the ratio of two k-μ random variables and the ratio of the two α-k-μ random variables are calculated. These expressions are used for evaluation level crossing rate of wireless communication system...